On a solution to display non-filled-in quaternionic Julia sets
نویسنده
چکیده
During early 1980s, the so-called ‘escape time’ method, developed to display the Julia sets for complex dynamical systems, was exported to quaternions in order to draw analogous pictures in this wider numerical field. Despite of the fine results in the complex plane, where all topological configurations of Julia sets have been successfully displayed, the ‘escape time’ method fails to render properly the non-filled-in variety of quaternionic Julia sets. So their digital visualisation remained an open problem for several years. Both the solution for extending this old method to nonfilled-in quaternionic Julia sets and its implementation into a program are explained here.
منابع مشابه
Methods and Applications to Display Quaternion Julia Sets
After explaining the details of an efficient technique, developed in early 1980s, to plot digital images of quaternion filled-in Julia sets, later considerations on it will introduce a new modification for displaying such sets with no interior too. A step by step description via pseudo-C++ is given. The reader is assumed to be familiar with advanced programming and quaternion calculus.
متن کاملComputability of Julia Sets
In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a polynomial is always computable.
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملFekete Polynomials and Shapes of Julia Sets
We prove that a nonempty, proper subset S of the complex plane can be approximated in a strong sense by polynomial filled Julia sets if and only if S is bounded and Ĉ \ int(S) is connected. The proof that such a set is approximable by filled Julia sets is constructive and relies on Fekete polynomials. Illustrative examples are presented. We also prove an estimate for the rate of approximation i...
متن کاملFilled Julia sets with empty interior are computable
We show that if a polynomial filled Julia set has empty interior, then it is computable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0608003 شماره
صفحات -
تاریخ انتشار 2006